Fun-Sort—or the chaos of unordered binary search

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fun-Sort--or the chaos of unordered binary search

Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated “binary searches” in an initially unsorted array also sorts n elements in time Θ(n log n). If n is a power of two then the expected termination point of a binary search in a random permutation of n elements is exactly the cell where the element should be if the array was sorted. We further sh...

متن کامل

AN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS

The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...

متن کامل

The CRT is the scaling limit of unordered binary trees

The Brownian Continuum Random Tree (CRT), introduced by Aldous [2], is a natural object that arises in various situations in Probability Theory. It is known to be the universal scaling limit for conditioned critical Galton-Watson trees with finite variance offspring distribution [4, 21, 12], or of random labeled trees on n vertices (Cayley trees) [2, 10, 1]. Several distinct proofs for the conv...

متن کامل

Profile and Height of Random Binary Search Trees

The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.

متن کامل

IIR System Identification Using Improved Harmony Search Algorithm with Chaos

Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2004

ISSN: 0166-218X

DOI: 10.1016/j.dam.2004.01.003